Monotonous subsequences and the descent process of invariant random permutations
نویسندگان
چکیده
منابع مشابه
Descending subsequences of random permutations
Given a random permutation of the numbers 1, 2, . . . . n, let L, be the length of the longest descending subsequence of this permutation. Let F, be the minimal header (first element) of the descending subsequences having maximal length. It is known that EL,/&,,,, c and that c=2. However, the proofs that r=2 are far from elementary and involve limit processes. Several relationships between thes...
متن کاملLongest Increasing Subsequences of Random Colored Permutations
We compute the limit distribution for the (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by Baik, Deift, and Johansson (math.CO/9810105). In the two–colored case our method provides a different proof of a similar result by Tracy and Widom about t...
متن کاملOn Increasing Subsequences of Random Permutations
Let Ln be the length of a longest increasing subsequence in a random permutation of {1, ..., n}. It is known that the expected value of Ln is asymptotically equal to 2 √ n as n gets large. This note derives upper bound on the probability that Ln − 2 √ n exceeds certain quantities. In particular, we prove that Ln − 2 √ n has order at most n1/6 with high probability. Our main result is an isoperi...
متن کاملOn longest increasing subsequences in random permutations
The expected value of L n , the length of the longest increasing subsequence of a random permutation of f1; : : : ; ng, has been studied extensively. This paper presents the results of both Monte Carlo and exact computations that explore the ner structure of the distribution of L n. The results suggested that several of the conjectures that had been made about L n were incorrect, and led to new...
متن کاملIncreasing Subsequences in Nonuniform Random Permutations
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing and decreasing subsequences in non-uniform random permutations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2018
ISSN: 1083-6489
DOI: 10.1214/18-ejp244